Semantic subtyping for the pi-calculus
نویسندگان
چکیده
منابع مشابه
Semantic Subtyping for the p-Calculus
Subtyping relations for the π-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-only and write-only channel types, as well as boolean combinations of types. A set-theoretic interpretation of types is provided, in which boolean ...
متن کاملSemantic subtyping for the π-calculus
Subtyping relations for the π-calculus are usually de-fined in a syntactic way, by means of structural rules. Wepropose a semantic characterisation of channel types anduse it to derive a subtyping relation.The type system we consider includes read-only andwrite-only channel types, as well as boolean combinationsof types. A set-theoretic interpretation of types is pro...
متن کاملTermination in a Pi-calculus with Subtyping
We present a type system to guarantee termination of π-calculus processes that exploits input/output capabilities and subtyping, as originally introduced by Pierce and Sangiorgi, in order to analyse the usage of channels. We show that our system improves over previously existing proposals by accepting more processes as terminating. This increased expressiveness allows us to capture sensible pro...
متن کاملType Reconstruction for Linear Pi-Calculus with I/O Subtyping
Powerful concurrency primitives in recent concurrent languages and thread libraries provide great flexibility about implementation of high-level features like concurrent objects. However, they are so low-level that they often make it difficult to check global correctness of programs or to perform non-trivial code optimization, such as elimination of redundant communication. In order to overcome...
متن کاملGlobal/Local Subtyping and Capability Inference for a Distributed pi-calculus
This paper considers how locality restrictions on the use of capabilities can be enforced by a static type system. A distributed -calculus with a simple reduction semantics is introduced, integrating location and migration primitives from the Distributed Join Calculus with asynchronous communication. It is given a type system in which the input and output capabilities of channels may be either ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.049